PLANAR SCHEMES TRACING IN THE SINGLE-LAYER CHANNEL
نویسندگان
چکیده
منابع مشابه
THREE SCHEMES FOR ACTIVE CONTROL OF THE PLANAR FRAME
Optimal locations of the actuators for frame active control are investigated in this article. The aim is to minimize the structural drifts by employing several actuators. By utilizing genetic algorithm, the appropriate locations of the actuators are determined. They should be placed in locations where they can minimize the maximum structural drift. To explore the capability of the proposed tech...
متن کاملSingle phase three-layer channel routing algorithms
We present a simple three-layer assignment algorithm for planar layouts generated by a class of layout algorithms. This class of algorithms includes simple variations of the following algorithms developed by Mehlhorn et al. (1986): (i) The algorithm that generates planar layouts for the two-terminal net CRP with dmax tracks. (ii) The algorithm that generates planar layouts for the twoand three-...
متن کاملParallel Algorithms for Single-Layer Channel Routing
We provide efficient parallel algorithms for the minimum separation, offset range, and optimal offset problems for single-layer channel routing. We consider all the variations of these problems that are known to have lineartime sequential solutions rather than limiting attention to the “river-routing” context, where single-sided connections are disallowed. For the minimum separation problem, we...
متن کاملMinimum Separation for Single-Layer Channel Routing
We provide a linear-time algorithm for determining the minimum separation required to route a channel when the connections can be realized in one layer. Differing from the usual “river-routing” context, we allow single-sided connections. The algorithm also works directly for problems with multiterminal nets and does not require wires to lie on an underlying grid, though it does use the rectilin...
متن کاملSingle - Layer Channel Routing and Placement with Single - SidedNetsRonald
This paper considers the optimal ooset, feasible ooset, and optimal placement problems for a more general form of single-layer VLSI channel routing than has usually been considered in the past. Most prior works require that every net has exactly one terminal on each side of the channel. As long as only one side of the channel contains multiple terminals of the same net, we provide linear-time s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electrical Engineering & Electromechanics
سال: 2014
ISSN: 2309-3404,2074-272X
DOI: 10.20998/2074-272x.2014.6.09